Enhanced Insertion Sort by Threshold Swapping

Imperative Insertion Sort

Bidirectional Conditional Insertion Sort algorithm; An efficient progress on the classical insertion sort

In this paper, we proposed a new efficient sorting algorithm based on insertion sort concept. The proposed algorithm called Bidirectional Conditional Insertion Sort (BCIS). It is in-place sorting algorithm and it has remarkably efficient average case time complexity when compared with classical insertion sort (IS). By comparing our new proposed algorithm with the Quicksort algorithm, BCIS indic...

Enhanced Bidirectional Selection Sort

An algorithm is a well-defined procedure that takes some input in the form of some values, processes them and gives the desired output. It forms the basis of many other algorithms such as searching, pattern matching, digital filters etc., and other applications have been found in database systems, data statistics and processing, data communications and pattern matching. This paper introduces al...

Enhanced Generic Key-Address Mapping Sort Algorithm

Various methods, such as address-calculation sort, distribution counting sort, radix sort, and bucket sort, adopt the values being sorted to improve sorting efficiency, but require extra storage space. This work presents a specific key-address mapping sort implementation. The proposed algorithm has the advantages of linear average-time performance and no requirement for linked-list data structu...

Insertion Sort with Self-reproducing Comparator P System

We present in this paper a self-reproducing comparator P system that simulates insertion sort. The comparator Πc is a degree–2 membrane and structured as μ = [h0 [h1 ]h1 [h2 ]h2 ]h0 . A maximizing Πc compares two multisets a and b where min(|a|, |b|) is stored in compartment h1 while max(|a|, |b|) is stored in compartment h2. A conditional reproduction rule triggers Πc to clone itself out via c...